Spectral mapping theorems and stability theory in linear dynamical systems
نویسندگان
چکیده
منابع مشابه
Spectral Mapping Theorems and Stability Theory in Linear Dynamical Systems
The spectral properties of the operators inducing linear dynamical systems on Banach spaces determine the asymptotic properties of the systems. In this note an interaction between the spectral mapping properties of operators and stability properties of the corresponding dynamical systems is presented.
متن کاملStability Theorems and Hyperbolicity in Dynamical Systems
We present an approach to proving structural stability and semi-stability theorems for diffeomorphisms and flows using the idea of shadowing an e-chain. We treat the cases when the whole manifold is hyperbolic and when the chain recurrent set is hyperbolic and the strong transversality condition is satisfied. The last two sections discuss the progress made on the converse to the structural stab...
متن کاملstability and attraction domains of traffic equilibria in day-to-day dynamical system formulation
در این پژوهش مسئله واگذاری ترافیک را از دید سیستم های دینامیکی فرمول بندی می کنیم.فرض کرده ایم که همه فاکتورهای وابسته در طول زمان ثابت باشند و تعادل کاربر را از طریق فرایند منظم روزبه روز پیگیری کنیم.دینامیک ترافیک توسط یک نگاشت بازگشتی نشان داده می شود که تکامل سیستم در طول زمان را نشان می دهد.پایداری تعادل و دامنه جذب را توسط مطالعه ویژگی های توپولوژیکی تکامل سیستم تجزیه و تحلیل می کنیم.پاید...
Spectral Filtering for General Linear Dynamical Systems
We give a polynomial-time algorithm for learning latent-state linear dynamical systems without system identification, and without assumptions on the spectral radius of the system’s transition matrix. The algorithm extends the recently introduced technique of spectral filtering, previously applied only to systems with a symmetric transition matrix, using a novel convex relaxation to allow for th...
متن کاملLearning Linear Dynamical Systems via Spectral Filtering
We present an efficient and practical algorithm for the online prediction of discrete-time linear dynamical systems with a symmetric transition matrix. We circumvent the non-convex optimization problem using improper learning: carefully overparameterize the class of LDSs by a polylogarithmic factor, in exchange for convexity of the loss functions. From this arises a polynomial-time algorithm wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Functional Analysis
سال: 2010
ISSN: 2008-8752
DOI: 10.15352/afa/1399900994